Global vs. Local Model Checking of Infinite State Systems

The verification of systems with infinite state spaces has attained considerable attention in recent years. In particular, both global and local model checking techniques have been applied to the verification of such systems. However, new symbolic representations like predicate logics and finite automata have only been used in global model checking. In this paper, we therefore propose a technique for local model checking that can benefit from these representations. Moreover, we compare both approaches and show that the classes of specifications which can be verified automatically are different.